Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
51	The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. SODA 2012 Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Algorithms Randomized rounding Rounding Matrix Entropy Mathematics Computer science Applied mathematics
52	Tight Bounds for Delay-Sensitive Aggregation Yvonne Anne Oswald Stefan Schmid Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:31 Routing Approximation algorithm Binary trees Computing Coding theory Routing algorithms Discrete mathematics
53	Adaptive Approximation by Greedy Algorithms Albert Cohen University of Paris VI (France) This talk will discuss computational algorithms that deal with the following general task: given a function f and a dictionary of f Add to Reading List Source URL: math.nyu.edu - Date: 2006-11-16 18:32:44
54	Hardness and Approximation Results for Black Hole Search in Arbitrary Networks⋆ Ralf Klasing⋆⋆, Euripides Markou⋆ ⋆ ⋆ , Tomasz Radzik† , and Fabiano Sarracco‡ Abstract. A black hole is a highly harmful st Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra Combinatorial optimization Search algorithms Game artificial intelligence A* search algorithm Shortest path problem Flow network Tree Graph
55	The Maximum Hypervolume Set Yields Near-optimal Approximation Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:08 Computational complexity theory Mathematical optimization Multi-objective optimization Base Approximation algorithms Mathematics
56	Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:44:56 Computational complexity theory Theory of computation Complexity classes Approximation algorithms Computational hardness assumptions Polynomial-time approximation scheme Time complexity NC Reduction Exponential time hypothesis NP-hardness NP
57	Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Marina Papatriantafilou Happier times in Iceland, Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2011-05-18 09:51:33 Mathematics Discrete mathematics Matching Combinatorics Cooperative games Game theory Combinatorial optimization Preference Stable marriage problem
58	Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann Tobias Friedrich Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:38 Mathematical analysis Mathematics Approximation algorithms Polynomial-time approximation scheme Pi NP-hard problems -net
59	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
60	Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2011-05-18 09:50:44 Graph theory Mathematics Combinatorial optimization Computational complexity theory Routing algorithms Search algorithms Operations research Matching A* search algorithm Flow network

UPDATE